Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
21	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:52 Mathematics Computational complexity theory Algebra NP-complete problems Analysis of algorithms Set cover problem Bin packing problem Linear programming relaxation Vertex cover Ring Exponentiation Big O notation
22	Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2016-07-30 09:35:21 Computational complexity theory Theory of computation Complexity classes Graph isomorphism problem NP PP Low Graph automorphism Hidden subgroup problem Time complexity P Chromatic polynomial
23	Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:44 Graph theory Mathematics Computational complexity theory Operations research Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Travelling salesman problem A* search algorithm Flow network Tree traversal
24	LNCSEfficient Dynamic Aggregation Add to Reading List Source URL: webee.technion.ac.il Language: English - Date: 2007-05-14 09:17:03 Graph theory Mathematics Computational complexity theory Edsger W. Dijkstra Network theory Shortest path problem Minimum spanning tree Network flow Dynamic programming
25	IMETUM Lecture Series Workshop-Series IMETUM Lecture Optimal Control Meets Medical Imaging Sciences: Applications, Formulations and Fast Solvers March 5, 2015 I30pm Add to Reading List Source URL: users.ices.utexas.edu Language: English - Date: 2016-08-16 23:26:38 Medical imaging Mathematics Computer vision Multivariable calculus Partial differential equation Algorithm Differential equation Inverse problem Image registration Computational engineering Academia
26	Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c Add to Reading List Source URL: somchaya.org Language: English - Date: 2014-05-05 11:44:38 Graph theory Mathematics Computational complexity theory Combinatorial optimization Matching Assignment problem Linear programming Multi-agent system Shortest path problem
27	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-01-06 16:13:01 Computational complexity theory Theory of computation Complexity classes NP Clique problem Linear programming P Algorithm Time complexity Optimization problem Book:Graph Theory P versus NP problem
28	Microsoft Word - orbs7180.doc Add to Reading List Source URL: www.math.hkbu.edu.hk Language: English - Date: 2013-09-27 05:04:48 Operations research Mathematics Computational complexity theory Applied mathematics Mathematical optimization Heuristic Integer programming Relaxation Branch and bound Combinatorial optimization Travelling salesman problem Algorithm
29	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:46:15 Computational complexity theory Mathematics NP-complete problems Theory of computation Packing problems Operations research Approximation algorithms Knapsack problem Vertex cover Bin packing problem Hardness of approximation Algorithm
30	SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-03-13 08:17:47 Computational complexity theory Mathematics NP-complete problems Theory of computation Set cover problem Approximation algorithm Algorithm Analysis of algorithms Bin packing problem Vertex cover